Hybrid Cellular Automata-Based Pseudo Random Sequence Generator for BIST Implementation
نویسنده
چکیده
The technique of Test pattern generation plays a key role in Built-In-Self-Test(BIST) architecture implementation. Main problem with any test pattern generator is to produce extended, random path succession which is applied to Circuit Under Test(CUT) for detecting faults. As real long numbers can be acquired as a part of physical developments only, these are complex to be employed inactual applications. Therefore, pseudorandom numbers are generated by artificial design patterns. In this paper we present a variation on a built-in-self-test (BIST) technique, which is based upon a pseudo random number generator derived from a onedimensional linear hybrid cellular automata (LHCA) array. Certain types of circuit faults are undetectable using the correlated bit streams produced by linear-feedback-shift-register (LFSR). In addition it is noted that CA implementations exhibit data compression properties similar to the LFSR. It is also possible that some of the analysis of pseudorandom testing may be more directly applicable to LHCA-based pseudorandom testing than to LFSR-based schemes. In the last two decades, researchers devoted many efforts to reduce the average power consumption in VLSI systems during normal operation mode, while power consumption during test operation mode was usually neglected. However, during test application circuits are subject to an activity level higher than the normal one: the extra power consumption due to test application may thus rise severe hazards to the circuit reliability. Moreover, it can dramatically shorten battery life when periodic testing of battery-powered systems is considered. In this paper we propose an algorithm to design a Test Pattern Generator based on Hybrid Cellular Automata for testing combinational circuits that effectively reduces power consumption.
منابع مشابه
A Novel Image Encryption Scheme Using Chaos and Hybrid Cellular Automata
This paper presents a novel image encryption scheme based on cellular automata (CA) and chaotic logistic mapping. The logistic chaotic mapping is used for shuffling the pixels which results in permutation. This permuted image is converted into a binary stream image where each rows of the image are converted into binary streams. Then a hybrid cellular automata (HCA) is used to provide diffusion ...
متن کاملHardware implementation of the elitist compact Genetic Algorithm using Cellular Automata pseudo-random number generator
In this paper the design and implementation of two versions of the compact Genetic Algorithm (cGA), with and without mutation and elitism, and a Cellular Automata-based pseudo-random number generator on a Field Programmable Gate Arrays (FPGAs) are accomplished. The design is made using a Hardware Description Language, called VHDL. Accordingly, the obtained results show that it is viable to have...
متن کاملFPGA Implementation of a Compact Genetic Algorithm using Cellular Automata Pseudo-Random Generator
In this paper the design and implementation of the compact Genetic Algorithm (cGA) and a Cellular Automata-based pseudo-random number generator on a Field Programmable Gate Arrays (FPGA) is accomplished. The design is made using the Hardware Description Language, called VHDL. Accordingly, the obtained results show that it is viable to have this searching algorithm in Hardware to be used in real...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملPseudo-random sequences, boolean functions and cellular automata
Generation of pseudo-random binary sequences by one-dimensional cellular automata is surveyed using both uniform and hybrid automata. The updating function is a Boolean function that must satisfy criteria of resilience and nonlinearity for the sequence they generate to be secure for a stream cipher application.
متن کامل